Localization Algorithms for GNSS-denied and Challenging Environments

In this dissertation, the problem about localization in GNSS-denied and challenging environments is addressed. Specifically, the challenging environments discussed in this dissertation include two different types, environments including only low-resolution features and environments containing moving objects. To achieve accurate pose estimates, the errors are always bounded through matching observations from sensors with surrounding environments. These challenging environments, unfortunately, would bring troubles into matching related methods, such as fingerprint matching, and ICP. For instance, in environments with low-resolution features, the on-board sensor measurements could match to multiple positions on a map, which creates ambiguity; in environments with moving objects included, the accuracy of the estimated localization is affected by the moving objects when performing matching. In this dissertation, two sensor fusion based strategies are proposed to solve localization problems with respect to these two types of challenging environments, respectively. For environments with only low-resolution features, such as flying over sea or desert, a multi-agent localization algorithm using pairwise communication with ranging and magnetic anomaly measurements is proposed in this dissertation. A scalable framework is then presented to extend the multi-agent localization algorithm to be suitable for a large group of agents (e.g., 128 agents) through applying CI algorithm. The simulation results show that the proposed algorithm is able to deal with large group sizes, achieve 10 meters level localization performance with 180 km traveling distance, while under restrictive communication constraints. For environments including moving objects, lidar-inertial-based solutions are proposed and tested in this dissertation. Inspired by the CI algorithm presented above, a potential solution using multiple features motions estimate and tracking is analyzed. In order to improve the performance and effectiveness of the potential solution, a lidar-inertial based SLAM algorithm is then proposed. In this method, an efficient tightly-coupled iterated Kalman filter with a build-in dynamic object filter is designed as the front-end of the SLAM algorithm, and the factor graph strategy using a scan context technology as the loop closure detection is utilized as the back-end. The performance of the proposed lidar-inertial based SLAM algorithm is evaluated with several data sets collected in environments including moving objects, and compared with the state-of-the-art lidar-inertial based SLAM algorithms

A Scalable Framework for Map Matching Based Cooperative Localization

Localization based on scalar field map matching (e.g., using gravity anomaly, magnetic anomaly, topographics, or olfaction maps) is a potential solution for navigating in Global Navigation Satellite System (GNSS)-denied environments. In this paper, a scalable framework is presented for cooperatively localizing a group of agents based on map matching given a prior map modeling the scalar field. In order to satisfy the communication constraints, each agent in the group is assigned to different subgroups. A locally centralized cooperative localization method is performed in each subgroup to estimate the poses and covariances of all agents inside the subgroup. Each agent in the group, at the same time, could belong to multiple subgroups, which means multiple pose and covariance estimates from different subgroups exist for each agent. The improved pose estimate for each agent at each time step is then solved through an information fusion algorithm. The proposed algorithm is evaluated with two different types of scalar field based simulations. The simulation results show that the proposed algorithm is able to deal with large group sizes (e.g., 128 agents), achieve 10-m level localization performance with 180 km traveling distance, while under restrictive communication constraints

Cooperative Navigation Using Pairwise Communication with Ranging and Magnetic Anomaly Measurements

The problem of cooperative localization for a small group of Unmanned Aerial Vehicles (UAVs) in a GNSS denied environment is addressed in this paper. The presented approach contains two sequential steps: first, an algorithm called cooperative ranging localization, formulated as an Extended Kalman Filter (EKF), estimates each UAV\u27s relative pose inside the group using inter-vehicle ranging measurements; second, an algorithm named cooperative magnetic localization, formulated as a particle filter, estimates each UAV\u27s global pose through matching the group\u27s magnetic anomaly measurements to a given magnetic anomaly map. In this study, each UAV is assumed to only perform a ranging measurement and data exchange with one other UAV at any point in time. A simulator is developed to evaluate the algorithms with magnetic anomaly maps acquired from airborne geophysical survey. The simulation results show that the average estimated position error of a group of 16 UAVs is approximately 20 meters after flying about 180 kilometers in 1 hour. Sensitivity analysis shows that the algorithms can tolerate large variations of velocity, yaw rate, and magnetic anomaly measurement noises. Additionally, the UAV group shows improved position estimation robustness with both high and low resolution maps as more UAVs are added into the group